Computability logic

Results: 552



#Item
71Analyzing proofs in analysis∗ Ulrich Kohlenbach Fachbereich Mathematik, J.W.Goethe–Universit¨at Robert–Mayer–Str. 6–10, D–60054 Frankfurt am Main, Germany  1

Analyzing proofs in analysis∗ Ulrich Kohlenbach Fachbereich Mathematik, J.W.Goethe–Universit¨at Robert–Mayer–Str. 6–10, D–60054 Frankfurt am Main, Germany 1

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2012-11-16 10:10:27
72Topics in the Theory and Practice of Computable Analysis Branimir Lambov PhD Dissertation

Topics in the Theory and Practice of Computable Analysis Branimir Lambov PhD Dissertation

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2006-06-09 09:40:53
73ON THE LOGICAL STRENGTHS OF PARTIAL SOLUTIONS TO MATHEMATICAL PROBLEMS LAURENT BIENVENU, LUDOVIC PATEY, AND PAUL SHAFER ABSTRACT. We use the framework of reverse mathematics to address the question of, given a mathematic

ON THE LOGICAL STRENGTHS OF PARTIAL SOLUTIONS TO MATHEMATICAL PROBLEMS LAURENT BIENVENU, LUDOVIC PATEY, AND PAUL SHAFER ABSTRACT. We use the framework of reverse mathematics to address the question of, given a mathematic

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2015-08-13 12:44:18
74CURRICULUM VITAE DAMIR D. DZHAFAROV Contact Department of Mathematics University of Connecticut

CURRICULUM VITAE DAMIR D. DZHAFAROV Contact Department of Mathematics University of Connecticut

Add to Reading List

Source URL: www.math.uconn.edu

Language: English - Date: 2016-05-15 18:54:00
75Reverse Mathematics and a Weak Ramsey-Type K¨onig’s Lemma Ludovic Patey   Laurent Bienvenu

Reverse Mathematics and a Weak Ramsey-Type K¨onig’s Lemma Ludovic Patey Laurent Bienvenu

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2013-04-16 05:41:23
76Proof mining in L1-approximation  Ulrich Kohlenbach a,1, Paulo Oliva a,1 a Department  of Computer Science, University of Aarhus, DK-8000 Aarhus C,

Proof mining in L1-approximation Ulrich Kohlenbach a,1, Paulo Oliva a,1 a Department of Computer Science, University of Aarhus, DK-8000 Aarhus C,

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2012-11-12 10:33:41
77Fachbereich Mathematik  Proof mining and combinatorics Program extraction for Ramsey’s theorem for pairs  Vom Fachbereich Mathematik

Fachbereich Mathematik Proof mining and combinatorics Program extraction for Ramsey’s theorem for pairs Vom Fachbereich Mathematik

Add to Reading List

Source URL: tuprints.ulb.tu-darmstadt.de

Language: English - Date: 2012-05-15 05:15:29
78I NTRODUCTION  P RINCIPLES ADMITTING A UNIVERSAL INSTANCE P RINCIPLES ADMITTING NO UNIVERSAL INSTANCE

I NTRODUCTION P RINCIPLES ADMITTING A UNIVERSAL INSTANCE P RINCIPLES ADMITTING NO UNIVERSAL INSTANCE

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2014-07-04 08:41:44
79BRICS  Basic Research in Computer Science BRICS RSU. Kohlenbach: On the No-Counterexample Interpretation  On the No-Counterexample Interpretation

BRICS Basic Research in Computer Science BRICS RSU. Kohlenbach: On the No-Counterexample Interpretation On the No-Counterexample Interpretation

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2012-11-16 09:12:20
80Formal Verification of Hardware Synthesis Thomas Braibant1 and Adam Chlipala2 1 Inria

Formal Verification of Hardware Synthesis Thomas Braibant1 and Adam Chlipala2 1 Inria

Add to Reading List

Source URL: plv.csail.mit.edu

Language: English - Date: 2015-12-16 11:34:17